On temporal graph exploration

نویسندگان

چکیده

A temporal graph is a in which the edge set can change from one time step to next. The exploration problem TEXP of computing foremost schedule for graph, i.e., walk that starts at given start node, visits all nodes and has smallest arrival time. In first part paper, we consider only undirected graphs are connected each step. For such with $n$ nodes, show it \NP-hard approximate ratio $O(n^{1-\varepsilon})$ every $\varepsilon>0$. We also provide an explicit construction require $\Theta(n^2)$ steps be explored. second still step, but assume underlying (i.e. contains edges present least step) belongs specific class graphs. Among other results, explored $O(n^{1.5}k^{1.5}\log n)$ if treewidth $k$, $O(n^{1.8}\log planar, $O(n\log^3 $2\times n$ grid. third settings where future not known constructed online. replace connectedness assumption by weaker $m$-edge regularly probabilistically online $O(m)$ $O(m \log high probability, respectively. finally latter result used obtain distributed algorithm gossiping random

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Temporal Graph Exploration

A temporal graph is a graph in which the edge set can change from step to step. The temporal graph exploration problem TEXP is the problem of computing a foremost exploration schedule for a temporal graph, i.e., a temporal walk that starts at a given start node, visits all nodes of the graph, and has the smallest arrival time. We consider only temporal graphs that are connected at each step. Fo...

متن کامل

TGD: visual data exploration of temporal graph data

This paper describes the social networking questions, analysis, design and approach taken in the realisation of an interactive solution for the VAST 2008 challenge. The solution presented is a case study in this approach and won the phone call mini challenge award. The problem scenario of the competition is used as a case study to explain the approach and experience with the developed tool. Des...

متن کامل

Distributed Graph Exploration

This article describes algorithms to compute spanning trees in an undirected network, that is, partition the set of edges into tree edges (these will be directed from parent to child) and non-tree edges. At the end no node will see the entire tree, but only the status of its own links (tree or non-tree). The problem of computing weight-minimal trees has received attention in the literature [GHS...

متن کامل

Fast Collaborative Graph Exploration

We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to comple...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2021

ISSN: ['1090-2724', '0022-0000']

DOI: https://doi.org/10.1016/j.jcss.2021.01.005